Calculating Radius of Robust Feasibility of Uncertain Linear Conic Programs via Semi-definite Programs
نویسندگان
چکیده
The radius of robust feasibility provides a numerical value for the largest possible uncertainty set that guarantees an uncertain linear conic program. This determines when feasible is non-empty. Otherwise, counterpart program not well defined as optimization problem. In this paper, we address key fundamental question optimization: How to compute programs, including programs? We first provide computable lower and upper bounds general programs under commonly used ball set. then important classes where are calculated by finding optimal values related semi-definite among them second-order cone support vector machine problems. case program, exact formula allows us calculate associated
منابع مشابه
Primal and dual robust counterparts of uncertain linear programs: an application to portfolio selection
This paper proposes a family of robust counterpart for uncertain linear programs (LP) which is obtained for a general definition of the uncertainty region. The relationship between uncertainty sets using norm bod-ies and their corresponding robust counterparts defined by dual norms is presented. Those properties lead us to characterize primal and dual robust counterparts. The researchers show t...
متن کاملRobust solutions of uncertain linear programs
We treat in this paper Linear Programming (LP) problems with uncertain data. The focus is on uncertainty associated with hard constraints: those which must be satisfied, whatever is the actual realization of the data (within a prescribed uncertainty set). We suggest a modeling methodology whereas an uncertain LP is replaced by its Robust Counterpart (RC). We then develop the analytical and comp...
متن کاملAdjustable robust solutions of uncertain linear programs
We consider linear programs with uncertain parameters, lying in some prescribed uncertainty set, where part of the variables must be determined before the realization of the uncertain parameters (”non-adjustable variables”), while the other part are variables that can be chosen after the realization (”adjustable variables”). We extend the Robust Optimization methodology ([1, 3, 4, 5, 6, 9, 13, ...
متن کاملMatrix Sum-of-Squares Relaxations for Robust Semi-Definite Programs
Received: date / Revised version: date Abstract. We consider robust semi-definite programs which depend polynomially or rationally on some uncertain parameter that is only known to be contained in a set with a polynomial matrix inequality description. On the basis of matrix sum-of-squares decompositions, we suggest a systematic procedure to construct a family of linear matrix inequality relaxat...
متن کاملSum of Squares Relaxations for Robust Polynomial Semi-definite Programs
A whole variety of robust analysis and synthesis problems can be formulated as robust Semi-Definite Programs (SDPs), i.e. SDPs with data matrices that are functions of an uncertain parameter which is only known to be contained in some set. We consider uncertainty sets described by general polynomial semi-definite constraints, which allows to represent norm-bounded and structured uncertainties a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2021
ISSN: ['0022-3239', '1573-2878']
DOI: https://doi.org/10.1007/s10957-021-01846-7